منابع مشابه
Syntactic Structures of Regular Languages
We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those three structures.
متن کاملSyntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...
متن کاملSyntactic Complexity of R- and J-Trivial Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of Rand J -trivial regular languages, and prove that n! and ⌊e(n −...
متن کاملTwo - Dimensional Regular Languages and Their Syntactic Characterization
In this paper, we deal with two-dimensional rectangular arrays for representing row and column structures such as symbol tables, spreadsheets, etc. Firstly we formalize the two-dimensional regular languages by pairs of regular expressions for rows and columns. Next we also introduce context-sensitive graph grammars called labeled grid graph grammars, which characterize the two-dimensional regul...
متن کاملThe Expressivity of Tree Languages for Syntactic Structures
In this paper, we investigate the expressivity of a series of languages describing syntactic structures, i.e. labeled ordered trees. Such a tree language states a formalism to describe certain sets of trees. We apply them to represent syntactic principles recently used in some theories of syntax. An investigation of the expressivity establishes the relationship to appropriate types of formal gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.10.020